Bandwidth on AT-free graphs

Bandwidth on AT-Free Graphs

We study the classical Bandwidth problem from the viewpoint of parametrised algorithms. Given a graph G = (V,E) and a positive integer k, the Bandwidth problem asks whether there exists a bijective function β : {1, . . . , |V |} → V such that for every edge uv ∈ E, |β(u) − β(v)| ≤ k. It is known that under standard complexity assumptions, no algorithm for Bandwidth with running time of the form...

On the bandwidth of Mobius graphs

Bandwidth labelling is a well known research area in graph theory. We provide a new proof that the bandwidth of Mobius ladder is 4, if it is not a $K_{4}$, and investigate the bandwidth of a wider class of Mobius graphs of even strips.

Fachbereich 3 Mathematik Treewidth Equals Bandwidth for At-free Claw-free Graphs Treewidth Equals Bandwidth for At-free Claw-free Graphs

A graph is called AT-free if it does not contain a triple of mutually independent vertices such that, between any two of them, there exists a path that avoids the neighborhood of the third. A triangulation of a graph is a chordal supergraph on the same vertex set. In this paper, the class of AT-free claw-free graphs (i.e., AT-free graphs without an induced K1;3) is characterized as exactly the ...

on the bandwidth of mobius graphs

bandwidth labelling is a well known research area in graph theory. we provide a new proof that the bandwidth of mobius ladder is 4, if it is not a $k_{4}$, and investigate the bandwidth of a wider class of mobius graphs of even strips.

On bandwidth-2 graphs